Solving Real Polynomial Systems with Real Homotopies
نویسندگان
چکیده
When a real homotopy is used for solving a polynomial system with real coefficients, bifurcation of some of the homotopy paths at singular points is inevitable. The main result of this paper shows that, generically, the solution set of a real homotopy contains no singular point other than a finite number of quadratic turning points. At a quadratic turning point, the bifurcation phenomenon is quite simple. It consists of two bifurcation branches with their tangent vectors being perpendicular to each other.
منابع مشابه
Numerical Evidence for a Conjecture in Real Algebraic Geometry
Homotopies for polynomial systems provide computational evidence for a challenging instance of a conjecture about whether all solutions are real. The implementation of SAGBI homotopies involves polyhedral continuation, at deformation and cheater's ho-motopy. The numerical diiculties are overcome if we work in the true synthetic spirit of the Schubert calculus by selecting the numerically most f...
متن کاملar X iv : a lg - g eo m / 9 70 60 04 v 1 1 0 Ju n 19 97 NUMERICAL SCHUBERT CALCULUS
We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface Schubert conditions we give two algorithms based on extrinsic deformations of the Grassmannian: one is derived from a Gröbner basis for the Plücker ideal of the G...
متن کاملBeyond Polyhedral Homotopies
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring. This approach generalizes the polyhedral homotopies by Huber and Sturmfels.
متن کاملZ Paramotopy: Parameter homotopies in parallel
Numerical algebraic geometry provides a number of efficient tools for approximating the solutions of polynomial systems. One such tool is the parameter homotopy, which can be an extremely efficient method to solve numerous polynomial systems that differ only in coefficients, not monomials. This technique is frequently used for solving a parameterized family of polynomial systems at multiple par...
متن کاملOn the Complexity of Real Solving of Bivariate Polynomial Systems
In this paper we present algorithmic and complexity results for polynomial sign evaluation over two real algebraic numbers, and for real solving of bivariate polynomial systems. Our main tool is signed polynomial remainder sequences; we exploit recent advances in univariate root isolation as well as multipoint evaluation techniques.
متن کامل